Topological quantum codes from self-complementary self-dual graphs
نویسندگان
چکیده
In this paper we present two new classes of binary quantum codes with minimum distance of at least three, by self-complementary self-dual orientable embeddings of “voltage graphs” and “Paley graphs in the Galois field GF (p)”, where p ∈ P and r ∈ Z. The parameters of two new classes of quantum codes are [[(2k + 2)(8k + 7), 2(8k +7k), dmin]] and [[(2k+2)(8k +9), 2(8k +9k +1), dmin]] respectively, where dmin ≥ 3. For these quantum codes, the code rate approaches 1 as k goes to infinity.
منابع مشابه
Constacyclic Codes over Group Ring (Zq[v])/G
Recently, codes over some special finite rings especially chain rings have been studied. More recently, codes over finite non-chain rings have been also considered. Study on codes over such rings or rings in general is motivated by the existence of some special maps called Gray maps whose images give codes over fields. Quantum error-correcting (QEC) codes play a crucial role in protecting quantum ...
متن کاملNew self-dual additive F4-codes constructed from circulant graphs
In order to construct quantum [[n, 0, d]] codes for (n, d) = (56, 15), (57, 15), (58, 16), (63, 16), (67, 17), (70, 18), (71, 18), (79, 19), (83, 20), (87, 20), (89, 21), (95, 20), we construct self-dual additive F4-codes of length n and minimum weight d from circulant graphs. The quantum codes with these parameters are constructed for the first time.
متن کاملOn Self-Dual Quantum Codes, Graphs, and Boolean Functions
A short introduction to quantum error correction is given, and it is shown that zero-dimensional quantum codes can be represented as self-dual additive codes over GF(4) and also as graphs. We show that graphs representing several such codes with high minimum distance can be described as nested regular graphs having minimum regular vertex degree and containing long cycles. Two graphs correspond ...
متن کاملGraph-based classification of self-dual additive codes over finite fields
Quantum stabilizer states over Fm can be represented as self-dual additive codes over Fm2 . These codes can be represented as weighted graphs, and orbits of graphs under the generalized local complementation operation correspond to equivalence classes of codes. We have previously used this fact to classify self-dual additive codes over F4. In this paper we classify selfdual additive codes over ...
متن کاملNew extremal binary self-dual codes of lengths 64 and 66 from bicubic planar graphs
Abstract. In this work, connected cubic planar bipartite graphs and related binary self-dual codes are studied. Binary self-dual codes of length 16 are obtained by face-vertex incidence matrices of these graphs. By considering their lifts to the ring R2 new extremal binary self-dual codes of lengths 64 are constructed as Gray images. More precisely, we construct 15 new codes of length 64. Moreo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Quantum Information Processing
دوره 14 شماره
صفحات -
تاریخ انتشار 2015